Towards the Construction of Attack Resistant and Efficient Overlay Streaming Topologies

Towards the Construction of Attack Resistant and Efficient Overlay Streaming Topologies

Even though overlay streaming is an inherently fault tolerant and stable system architecture, careful neighbor selection is a significant task. Inappropriate routing decisions can lead to an unstable topology with only a few very important nodes on which a large set of succeeding nodes depend. The presented algorithm selects streaming neighbors based on local information, passing knowledge to p...

Construction of attack-resilient and efficient overlay topologies for large-scale P2P-based IPTV infrastructures

Netzwerkeffizienz stabiler Overlay-Streaming-Topologien (Network Efficiency of Stable Overlay Streaming Topologies)

In order to distribute multimedia content, in peer-to-peer based approaches, all participants choose other peers as neighbours, thus spanning an overlay network of logical nodes and connecting edges. In building such an overlay for live multimedia streaming, two important properties of the evolving topologies have to be considered: The efficiency regarding the transmission cost in the network a...

construction and validation of the translation teacher competency test and the scale of students’ perceptions of translation teachers

the major purpose of this study was to develop the translation teacher competency test (ttct) and examine its construct and predictive validity. the present study was conducted in two phases: a qualitative phase as well as a quantitative phase. in the first phase of the study, the author attempted to find out the major areas of competency required for an academic translation teacher. the second...

Efficient and Resilient Overlay Topologies over Ad Hoc Networks

We discuss what kind of overlay topology should be proactively built before an overlay routing protocol enters a route search process on top of it. The basic overlay structures we study are the K-Nearest Neighbours overlay topologies, connecting every overlay node to its K nearest peers. We introduce a family of optimizations, based on a pruning rule. As flooding is a key component of many rout...